A Semi-monad for Semi-structured Data

نویسندگان

  • Mary F. Fernández
  • Jérôme Siméon
  • Philip Wadler
چکیده

This document proposes an algebra for XML Query. The algebra has been submitted to the W3C XML Query Working Group. A novel feature of the algebra is the use of regular-expression types, similar in power to DTDs or XML Schemas, and closely related to Hasoya and Pierce’s work on Xduce. The iteration construct is based on the notion of a monad, and involves novel typing rules not encountered elsewhere.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ORA-SS: An Object-Relationship-Attribute Model for Semi-Structured Data

Semi structured data is becoming increasingly important with the introduction of XML and related languages and technologies The recent shift from DTDs document type de nitions to XML Schema for XML data highlights the importance of a schema de nition for semi structured data applications At the same time there is a move to extend semi structured data models to express richer semantics In this p...

متن کامل

Survey on Mining in Semi-Structured Data

Emerging technologies of semi-structured data have attracted wide attention of networks, e-commerce, information retrieval and databases. In these applications, the data are modeled not as static collections but as transient data streams, where the data source is an unbounded stream of individual data items. It is becoming increasingly popular to send heterogeneous and ill-structured data throu...

متن کامل

Discovering Frequent Substructures from Hierarchical Semi-structured Data

Frequent substructure discovery from a collection of semi-structured objects can serve for storage, browsing, querying, indexing and classification of semi-structured documents. This paper examines the problem of discovering frequent substructures from a collection of hierarchical semi-structured objects of the same type. The use of wildcard is an important aspect of substructure discovery from...

متن کامل

Evaluation of Top-k Queries over Structured and Semi-structured Data

Evaluation of Top-k Queries over Structured and Semi-structured Data

متن کامل

Querying Web Forms and Nested Semi-structured Data

Semi-structured data are commonly represented by labelled graphs. These graphs can be simple or nested. In this paper we present how to model nested semi-structured data in the presence of Web forms. Our motivation is to bring our data model more realistic to capture the richness of Web data. The main purpose of the paper is to provide a mechanism to query nested semi-structured data and web fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001